Towards Optimal and Expressive Kernelization for d-Hitting Set
نویسندگان
چکیده
منابع مشابه
Kernelization Algorithms for d-Hitting Set Problems
A kernelization algorithm for the 3-Hitting-Set problem is presented along with a general kernelization for d-Hitting-Set problems. For 3-Hitting-Set, a quadratic kernel is obtained by exploring properties of yes instances and employing what is known as crown reduction. Any 3-Hitting-Set instance is reduced into an equivalent instance that contains at most 5k + k elements (or vertices). This ke...
متن کاملHitting forbidden minors: Approximation and Kernelization
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such that the resulting graph does not contain as a minor any graph from the family F of forbidden minors. We obtain a number of algorithmic results on the F -Deletion problem when F contains a planar graph. We give • a li...
متن کاملParameterized Algorithms for d-Hitting Set: the Weighted Case
We are going to analyze simple search tree algorithms for Weighted d-Hitting Set. Although the algorithms are simple, their analysis is technically rather involved. However, this approach allows us to even improve on elsewhere previously published running time estimates for the more restricted case of (unweighted) d-Hitting Set. 1
متن کاملLinear-Time Kernelization for Feedback Vertex Set
In this paper, we give an algorithm that, given an undirected graph G of m edges and an integer k, computes a graph G′ and an integer k′ in O(km) time such that (1) the size of the graph G′ is O(k), (2) k′ ≤ k, and (3) G has a feedback vertex set of size at most k if and only if G′ has a feedback vertex set of size at most k′. This is the first linear-time polynomial-size kernel for Feedback Ve...
متن کاملA Kernelisation Approach for Multiple d-Hitting Set and Its Application in Optimal Multi-Drug Therapeutic Combinations
Therapies consisting of a combination of agents are an attractive proposition, especially in the context of diseases such as cancer, which can manifest with a variety of tumor types in a single case. However uncovering usable drug combinations is expensive both financially and temporally. By employing computational methods to identify candidate combinations with a greater likelihood of success ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2013
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-013-9774-3